An implicit path enumeration model and algorithm for dynamic traffic assignment with congestion spillback

نویسندگان

  • LORENZO MESCHINI
  • GIUSEPPE BELLEI
  • GUIDO GENTILE
  • NATALE PAPOLA
چکیده

A new continuous formulation of Dynamic Traffic Assignment, where a user equilibrium is expressed as a fixed point problem in terms of arc flow temporal profiles, is proposed. The precise aim of the paper is to integrate spillback modelling into an existing formulation of DTA, based on implicit path enumeration, which is capable of representing explicitly the formation and dispersion of vehicle queues on the road network, but allows the queue length to overcome the arc length. Specifically, we take into account the interaction among network links upstream and downstream road intersections deriving from time varying entering and exiting arc capacities due to vehicle queue spillovers, which is equivalent to introducing constraints on the queue lengths. To achieve this extension we introduce a sequence of models, that is the arc entering capacity model, the arc exiting capacity model, and the arc travel time model for time varying exiting capacity, describing, for given turning flow temporal profiles, the dynamic of the network nodes and arcs, and capable of representing the propagation of congestion among contiguous road links. Some numerical examples are devised to appreciate the relevant effect of spillback modelling in the context of DTA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spillback congestion in dynamic traffic assignment : a macroscopic flow model with time - varying bottlenecks

In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks in which we explicitly address the simulation of queue spillovers where a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing for...

متن کامل

Influence of Spillback Effect on Dynamic Shortest Path Problems with Travel-Time-Dependent Network Disruptions

Traffic network disruptions lead to a significant increase in travel time and hence transportation costs. An efficient routing model requires a good description of the congestion dynamics. One of these dynamics is the spillback effect, i.e. congestion propagation to upstream links. This leads to a secondary delay in the upstream road where the speed of the vehicles in the upstream road decrease...

متن کامل

Probit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach

Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...

متن کامل

Literature Review of Traffic Assignment: Static and Dynamic

Rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. In the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. With traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. Four s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004